How b - skeletons lose their edges
نویسنده
چکیده
A b-skeleton is a proximity graphs with node neighbourhood defined by continuous-valued parameter b. Two nodes in a b-skeleton are connected by an edge if their lune-based neighbourhood contains no other nodes. With increase of b some edges a skeleton are disappear. We study how a number of edges in b-skeleton depends on b. We speculate how this dependence can be used to discriminate between random and non-random planar sets. We also analyse stability of b-skeletons and their sensitivity to perturbations. 2013 Elsevier Inc. All rights reserved.
منابع مشابه
How beta-skeletons lose their edges
A β-skeleton is a proximity graphs with node neighbourhood defined by continuousvalued parameter β. Two nodes in a β-skeleton are connected by an edge if their lune-based neighbourhood contains no other nodes. With increase of β some edges a skeleton are disappear. We study how a number of edges in β-skeleton depends on β. We speculate how this dependence can be used to discriminate between ran...
متن کاملOn growing connected β-skeletons
A β-skeleton, β ≥ 1, is a planar proximity undirected graph of an Euclidean points set, where nodes are connected by an edge if their lune-based neighbourhood contains no other points of the given set. Parameter β determines the size and shape of the lune-based neighbourhood. A β-skeleton of a random planar set is usually a disconnected graph for β > 2. With the increase of β, the number of edg...
متن کاملStraight skeletons with additive and multiplicative weights and their application to the algorithmic generation of roofs and terrains
We introduce additively-weighted straight skeletons as a new generalization of straight skeletons. An additively-weighted straight skeleton is the result of a wavefront-propagation process where, unlike in previous variants of straight skeletons, wavefront edges do not necessarily start to move at the begin of the propagation process but at later points in time. We analyze the properties of add...
متن کاملPerceptually stable regions for arbitrary polygons
Zou and Yan have recently developed a skeletonization algorithm of digital shapes based on a regularity/singularity analysis; they use the polygon whose vertices are the boundary pixels of the image to compute a constrained Delaunay triangulation (CDT) in order to find local symmetries and stable regions. Their method has produced good results but it is slow since its complexity depends on the ...
متن کاملDeveloping Formal Specifications to Coordinate Heterogeneous Autonomous Agents
We have been developing an approach for the distributed coordination of heterogeneous, autonomous agents. This approach takes as input (a) agent skeletons, giving compact descriptions of the given agents in terms of their events that are significant for coordination, as well as (b) relationships among the events occurring in these skeletons. A natural question is how may the skeletons and relat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013